2489 Gps Scheduling with Graceful Rate Adaptation
نویسندگان
چکیده
This paper addresses a shortcoming of the widely used Generalized Processor Sharing (GPS) scheduling a1 U rithm which can have significant impact on the pmviied service, however; which has been given little attention. Since, with GPS, the service rate received by a session is proportional to the number of backlogged sessions in the system, the service rate of a session may change abruptly if some other session becomes active. This may result in abrupt increases of delay of consecutive packets. In this paper; we present and analyze a new schedule< called Slow-Start GPS (PGPS) . which alleviates the pmblem. S2GPS is a modijication of GPS where a session does not receive its guaranteed service rate immediately afer it becomes active. Instead, the service rate of a session is gradually increased.
منابع مشابه
A CPU Scheduling Algorithm for Continuous Media Applications
We provide an overview of a CPU management algorithm called RAP (Rate-based Adjustable Priority Scheduling) that provides predictable service and dynamic QOS control in the presence of varying compute times, arrival and departure of processes, and CPU overloads. A signiicant feature of RAP includes an application-level QOS manager that implements policies for graceful adaptation in the face of ...
متن کاملTask Scheduling Algorithm Using Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in Cloud Computing
The cloud computing is considered as a computational model which provides the uses requests with resources upon any demand and needs.The need for planning the scheduling of the user's jobs has emerged as an important challenge in the field of cloud computing. It is mainly due to several reasons, including ever-increasing advancements of information technology and an increase of applications and...
متن کاملS 2 GPS : Slow - Start Generalized Processor Sharing
Packet scheduling methods that approximate Generalized Processor Sharing (GPS) are currently the focus of much research in the area of Quality-of-Service (QoS) networks. The ability of GPS schedulers to provide rate guarantees as well as delay guarantees meets the demand of many network applications. This paper addresses a shortcoming of GPS which can have signiicant impact on the service provi...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملLarge Deviations and the Generalized Processor Sharing Scheduling: Upper and Lower Bounds Part II: Multiple-Queue Systems
We prove asymptotic upper and lower bounds on the asymptotic decay rate of per-session queue length tail distributions for a single constant service rate server queue shared by multiple sessions with the generalized processor sharing (GPS) scheduling discipline. The special case of a two-queue GPS system has been dealt with separately in Part I of the paper [33], where exact bounds are obtained...
متن کامل